Practical Algorithms for Distributed Network Control

Optimal routing and scheduling algorithms have been studied for decades, however several practical issues prevent the adoption of these network control policies on the Internet. This thesis considers two distinct topics in distributed network control: (i) maximizing throughput in wireless networks using network coding, and (ii) deploying controllable nodes in legacy networks. Network coding is a relatively new technique that allows for an increase in throughput under certain topological and routing conditions. The first part of this thesis considers jointly optimal routing, scheduling, and network coding strategies to maximize throughput in wireless networks. We introduce a simple network coding strategy and fully characterize the region of arrival rates supported. We propose a centralized dynamic control policy for routing, scheduling, and our network coding strategy, and prove this policy to be throughput optimal subject to our coding constraint. We further propose a distributed control policy based on random access that optimizes for routing, scheduling, and pairwise coding, where pairwise coding captures most of the coding opportunities on random topologies. We prove this second policy to also be throughput optimal subject to the coding constraint. Finally, we reduce the gap between theory and practice by identifying and solving several problems that may occur in system implementations of these policies. Throughput optimal policies typically require every device in the network to make dynamic routing decisions. In the second part of this thesis, we propose an overlay routing architecture such that only a subset of devices (overlay nodes) need to make dynamic routing decisions, and yet maximum throughput can still be achieved. We begin by formulating an optimization problem that searches for the minimum overlay node placement that achieves maximum throughput. We devise an efficient placement algorithm which solves this problem optimally for networks not subject to interference constraints. Then we propose a heuristic control policy for use at overlay nodes, and show by simulation that this policy performs optimally in all studied scenarios. Thesis Supervisor: Eytan Modiano Title: Professor of Aeronautics and Astronautics